Protein residue networks from a local search perspective
نویسنده
چکیده
We examined protein residue networks (PRNs) from a local search perspective to understand why PRNs are highly clustered when having short paths is important for protein functionality. We found that by adopting a local search perspective, this conflict between form and function is resolved as increased clustering actually helps to reduce path length in PRNs. Further, the paths found via our EDS local search algorithm are more congruent with the characteristics of intra-protein communication. EDS identifies a subset of PRN edges called short-cuts that are distinct, have high usage, impacts EDS path length, diversity and stretch, and are dominated by short-range contacts. The short-cuts form a network (SCN) that increases in size and transitivity as a protein folds. The structure of a SCN supports its function and formation, and the function of a SCN influences its formation. Several significant differences in terms of SCN structure, function and formation is found between “successful” and “unsuccessful” MD trajectories. We hypothesize that strong SCN transitivity is a hallmark of well-formed SCNs, and suggest the possibility of using SCN transitivity as a folding coordinate for proteins whose native state is not known a priori. By connecting the static and the dynamic aspects of PRNs, the protein folding process becomes a problem of network/graph formation with the purpose of forming suitable pathways within proteins. Outline of manuscript:
منابع مشابه
Comparing local search paths with global search paths on protein residue networks: allosteric communication
Although proteins have been recognized as small-world networks and their small-world network properties of clustering and short paths have been exploited computationally to produce biologically relevant information, they have not been truly explored as such, i.e. as navigable small-world networks in the original spirit of Milgram’s work. This research seeks to fill this gap by exploring local s...
متن کاملLocal search on protein residue networks
Self-avoiding random walks were performed on protein residue networks. Compared with protein residue networks with randomized links, the probability of a walk being successful is lower and the length of successful walks shorter in (non-randomized) protein residue networks. Fewer successful walks and shorter successful walks point to higher communication specificity between protein residues, a c...
متن کاملDesigning Of Degenerate Primers-Based Polymerase Chain Reaction (PCR) For Amplification Of WD40 Repeat-Containing Proteins Using Local Allignment Search Method
Degenerate primers-based polymerase chain reaction (PCR) are commonly used for isolation of unidentified gene sequences in related organisms. For designing the degenerate primers, we propose the use of local alignment search method for searching the conserved regions long enough to design an acceptable primer pair. To test this method, a WD40 repeat-containing domain protein from Beauveria bass...
متن کاملA Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network
Abstract Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...
متن کاملEvolution of protein structures and interactions from the perspective of residue contact networks.
Here we review mechanisms of protein evolution leading to structural changes in protein complexes. These mechanisms include mutations directly within protein interfaces, as well as the effects of mutations that propagate from distant regions of the protein. We also discuss the constraints protein complex structures impose on sequence evolution. We interpret, wherever possible, these mechanisms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Complex Networks
دوره 4 شماره
صفحات -
تاریخ انتشار 2016